An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Fast Computation of Pseudo-Zernike Moments
Pseudo-Zernike moments have better feature representation capabilities and are more robust to image noise than the conventional Zernike moments. However, pseudo-Zernike moments have not been extensively used as feature descriptors due to the computational complexity of the pseudo-Zernike radial polynomials. This paper discusses the drawbacks of the existing methods, and proposes an efficient re...
متن کاملAn Algorithm for Fast Computation of 3D Zernike Moments for Volumetric Images
An algorithm was proposed for very fast and low-complexity computation of three-dimensional Zernike moments. The 3D Zernike moments were expressed in terms of exact 3D geometric moments where the later are computed exactly through the mathematical integration of the monomial terms over the digital image/object voxels. A new symmetry-based method was proposed to compute 3D Zernikemoments with 87...
متن کاملFast computation of accurate pseudo zernike moments for binary and gray-level images
A new method is proposed for fast computation of accurate pseudo-Zernike moments for binary and gray level images. These orthogonal moments are computed as a linear combination of accurate geometric and radial geometric moments, which are computed by mathematical integration of the monomial polynomials over digital image pixels. The proposed method is fast, accurate, simple, and easy programmab...
متن کاملNumerical stability of fast computation algorithms of Zernike moments
A detailed, comparative study of the numerical stability of the recursive algorithms, widely used to calculate the Zernike moments of an image, is presented in this paper. While many papers, introducing fast algorithms for the computation of Zernike moments have been presented in the literature, there is not any work studying the numerical behaviour of these methods. These algorithms have been ...
متن کاملA novel approach to the fast computation of Zernike moments
This paper presents a novel approach to the fast computation of Zernike moments from a digital image. Most existing fast methods for computing Zernike moments have focused on the reduction of the computational complexity of the Zernike 1-D radial polynomials by introducing their recurrence relations. Instead, in our proposed method, we focus on the reduction of the complexity of the computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2003
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001403002769